The incidence coloring number of Halin graphs and outerplanar graphs
نویسندگان
چکیده
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملAlgorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
متن کاملStrong edge-coloring for cubic Halin graphs
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...
متن کاملOn Coloring Squares of Outerplanar Graphs
We study vertex colorings of the square G of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of G when ∆ ≥ 7. In the case of chordal outerplanar graphs, we classify exactly which g...
متن کاملTotal coloring of pseudo-outerplanar graphs
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the total coloring conjecture is completely confirmed for pseudoouterplanar graphs. In particular, it is proved that the total chromatic number of every pseudo-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00302-8